Restricted Connectivity of Cartesian Product Graphs
نویسندگان
چکیده
For a connected graph G = (V (G), E(G)), a vertex set S ⊆ V (G) is a k-restricted vertex-cut if G − S is disconnected such that every component of G − S has at least k vertices. The k-restricted connectivity κk(G) of the graph G is the cardinality of a minimum k-restricted vertex-cut of G. In this paper, we give the 3-restricted connectivity and the 4-restricted connectivity of the Cartesian product graphs, and we proposed two conjectures for general cases of the k-restricted connectivity of the Cartesian product graphs.
منابع مشابه
On restricted edge connectivity of regular Cartesian product graphs
Explicit expressions of the restricted edge connectivity of the Cartesian product of regular graphs are presented; some sufficient conditions for regular Cartesian product graphs to be maximally or super restricted edge connected are obtained as a result.
متن کاملThe k-restricted edge-connectivity of a product of graphs
This work deals with a generalization of the Cartesian product of graphs, the product graph Gm ∗Gp introduced by Bermond et al. [J.C. Bermond, C. Delorme, G. Farhi, Large graphs with givendegree anddiameter II, J. Combin. Theory, Series B 36 (1984), 32–48]. The connectivity of these product graphs is approached by studying the k-restricted edge-connectivity, which is defined as the minimum numb...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملTwo bounds for generalized 3-connectivity of Cartesian product graphs
The generalized k-connectivity κk(G) of a graphG, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let G and H be nontrivial connected graphs. Recently, Li et al. gave a lower bound for the generalized 3-connectivity of the Cartesian product graph G H and proposed a conjecture for the case that H is 3-connected. In this paper, we give two...
متن کاملSecret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کامل